A parameterized view on the complexity of dependence and independence logic

Abstract In this paper, we investigate the parameterized complexity of model checking for Dependence and Independence logic, which are well studied logics in area Team Semantics. We start with a list nine immediate parameterizations problem, namely number disjunctions (i.e. splits)/(free) variables/universal quantifiers, formula-size, tree-width Gaifman graph input structure, size universe/team arity dependence atoms. present comprehensive picture obtain division problem into tractable various intractable degrees. Furthermore, also consider most important variants (data expression complexity) by fixing parts input.